Explicit lower bounds on the outage probability of integer forcing over Nr × 2 channels

The performance of integer-forcing equalization for communication over the compound multiple-input multipleoutput channel is investigated. An upper bound on the resulting outage probability as a function of the gap to capacity has been derived previously, assuming a random precoding matrix drawn from the circular unitary ensemble is applied prior to transmission. In the present work a simple and explicit lower bound on this outage probability is derived for the case of a system with two transmit antennas, leveraging the properties of the Jacobi ensemble. The derived lower bound is also extended to random unitary space-time precoding, and may serve as a useful benchmark for assessing the relative merits of various algebraic space-time precoding schemes.